Extended gcd of quadratic integers

نویسندگان

  • Abdelwaheb Miled
  • Ahmed Ouertani
چکیده

where θ = 1 + √ d 2 if d mod 4 = 1 and θ = √ d if d mod 4 = 2, 3. The purpose of this paper is to compute the extended gcd of to quadratic integers in ring Z[θ]. We assume throughout that Z[θ] is principal ideal ring, but not necessarily an euclidean ring. If [a, b+ cθ] is the module {ax+(b+ cθ)y, x, y ∈ Z}, it can be shown [3] that I is an ideal of Z[θ] if and only if I = [a, b+ cθ]; where a, b, c ∈ Z with c|b, c|a and ac|N(b+ cθ), (N(b+ cθ) the norm of b+ cθ). It is known [?, Samuel]hat any non-zero ideal of Z[θ] is a free Z-module of range 2 If I = Zα + Z(β + γθ) is an ideal of Z[θ], then I have a generator for which the absolute value of the norm is equal to the norm N(I) of I (where N(I) = |α× γ|). Conversely any X in I such that |N(X)| = N(I) is a generator of I. 2-Algorithm of the extended gcd Let I = [a + bθ], J = [c + dθ] non-zero ideals of Z[θ], then I + J = [m + nθ] is an ideal, and m+nθ = gcd((a+ bθ), (c+ dθ)). This gcd is defined modulo a unity of Q( √ d). There exist U, V ∈ Z[θ] such that

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Binary GCD Like Algorithms for Some Complex Quadratic Rings

On the lines of the binary gcd algorithm for rational integers, algorithms for computing the gcd are presented for the ring of integers in Q( √ d) where d ∈ {−2,−7,−11,−19}. Thus a binary gcd like algorithm is presented for a unique factorization domain which is not Euclidean (case d = −19). Together with the earlier known binary gcd like algorithms for the ring of integers in Q( √−1) and Q(√−3...

متن کامل

Acceleration of Euclidean Algorithm and Rational Number Reconstruction

We accelerate the known algorithms for computing a selected entry of the extended Euclidean algorithm for integers and, consequently, for the modular and numerical rational number reconstruction problems. The acceleration is from quadratic to nearly linear time, matching the known complexity bound for the integer gcd, which our algorithm computes as a special case.

متن کامل

Two Fast Parallel GCD Algorithms of Many Integers

We present two new parallel algorithms which compute the GCD of n integers of O(n) bits in O(n/ logn) time with O(n) processors in the worst case, for any ε > 0 in CRCW PRAM model. More generally, we prove that computing the GCD of m integers of O(n) bits can be achieved in O(n / logn) parallel time with O(mn ) processors, for any 2 ≤ m ≤ n/ logn, i.e. the parallel time does not depend on the n...

متن کامل

8430 Handout 3: Elementary Theory of Quadratic Forms

Let f = ax + bxy+ cy be a quadratic form and suppose that d = gcd(a, b, c) > 1. Then f can only represent integers which are multiples of d – in particular it can represent at most one prime, and no primes at all if d is not prime. Moreover f represents dN iff the integral form 1 df represents N , so there is no loss of generality in considering only the case gcd(a, b, c) = 1. Such forms are sa...

متن کامل

A New GCD Algorithm for Quadratic Number Rings with Unique Factorization

We present an algorithm to compute a greatest common divisor of two integers in a quadratic number ring that is a unique factorization domain. The algorithm uses O(n log n log log n + ∆ 1 2 + ) bit operations in a ring of discriminant ∆. This appears to be the first gcd algorithm of complexity o(n) for any fixed non-Euclidean number ring. The main idea behind the algorithm is a well known relat...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • CoRR

دوره abs/1002.4487  شماره 

صفحات  -

تاریخ انتشار 2010